Large pseudocounts and L[subscript 2]-norm penalties are necessary for the mean-field inference of Ising and Potts models
نویسندگان
چکیده
منابع مشابه
Large pseudocounts and L2-norm penalties are necessary for the mean-field inference of Ising and Potts models.
The mean-field (MF) approximation offers a simple, fast way to infer direct interactions between elements in a network of correlated variables, a common, computationally challenging problem with practical applications in fields ranging from physics and biology to the social sciences. However, MF methods achieve their best performance with strong regularization, well beyond Bayesian expectations...
متن کاملar X iv : h ep - l at / 9 70 40 20 v 1 3 0 A pr 1 99 7 Potts Models on Feynman Diagrams
We investigate numerically and analytically Potts models on " thin " random graphs – generic Feynman diagrams, using the idea that such models may be expressed as the N → 1 limit of a matrix model. The thin random graphs in this limit are locally tree-like, in distinction to the " fat " random graphs that appear in the planar Feynman diagram limit, N → ∞, more familiar from discretized models o...
متن کاملمحاسبه انحنای اسکالر در مدل اسپینی مختلط چهارحالته و بررسی رفتار آن
In various statistical mechanical models, introduction of a metric into space of prameters gives a new perspective to the phase structure. In this paper, the scalar curvature R of this metric for a one dimensional four-state complex spin model is calculated. It is shown that this parameter has a similar behaviour to the Ising and Potts models.
متن کاملUniversality of the mean-field for the Potts model
Weconsider the Pottsmodelwith q colors on a sequence ofweighted graphs with adjacency matrices An , allowing for both positive and negative weights. Under a mild regularity condition on An we show that the mean-field prediction for the log partition function is asymptotically correct, whenever tr(An) = o(n). In particular, our results are applicable for the Ising and the Potts models on any seq...
متن کاملThe Random-cluster Model on the Complete Graph
Béla Bollobás, Geoffrey Grimmett, Svante Janson Abstract. The random-cluster model of Fortuin and Kasteleyn contains as special cases the percolation, Ising, and Potts models of statistical physics. When the underlying graph is the complete graph on n vertices, then the associated processes are called ‘mean-field’. In this study of the mean-field random-cluster with parameters p = λ/n and q, we...
متن کامل